7024 ANNALES DU LAMSADE N ° 6 Octobre 2006
نویسندگان
چکیده
In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolarvalued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels in a crisp digraph. A third section will be concerned with extending these algorithms to bipolar-valued outranking digraphs.
منابع مشابه
ANNALES DU LAMSADE N ° 3 Octobre 2004
The Marquis du Condorcet recognized 200 years ago that majority rule can produce intransitive group preferences if the domain of possible (transitive) individual preference orders is unrestricted. We present results on the cardinality and structure of those maximal sets of permutations for which majority rule produces transitive results (consistent sets). Consistent sets that contain a maximal ...
متن کاملTutorial on Formal Methods for Distributed and Cooperative Systems
1 Université Paris 13, LIPN, CNRS UMR 7030 99 avenue Jean-Baptiste Clément, F-93430 Villetaneuse, France {Christine Choppy,Laure.Petrucci}@lipn.univ-paris13.fr 2 Université Paris-Dauphine, LAMSADE, CNRS UMR 7024 place du Maréchal de Lattre de Tassigny, F-75775 Paris Cedex 16 [email protected] 3 Université d’Evry-Val-d’Essone, IBISC, CNRS FRE 2873 523, place des Terrasses de l’Agora, 91...
متن کاملANNALES DU LAMSADE N ° 7 Mai 2007 Robustness in OR - DA
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also inv...
متن کاملLaboratoire d’Analyse et Modélisation de Systèmes pour l’Aide à la Décision UMR CNRS 7024
This article focuses on polynomial approximation of optimization problems. The classical approximation classes (APX, PTAS,. . . ) have been structured by the introduction of approximation-preserving reductions and notions of completeness. For instance, natural problems are known to be APXor DAPX-complete (under the ∗ LAMSADE, Université Paris-Dauphine, 75775 Paris cedex 16, France. {bazgan,esco...
متن کاملWe consider min set covering when the subsets are constrained to have maximum
Cahier du LAMSADE N° 232 We consider min set covering when the subsets are constrained to have maximum cardinality three. We propose an exact algorithm whose worst case complexity is bounded above by O_(1:3957n). This is an improvement, based on a re_ned analysis, of a former result (O_(1:4492n)) by F. Della Croce and V. Th. Paschos, Computing optimal solutions for the min 3-set covering proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006